Simulating Computations in Second Order Non-Commutative Linear Logic

نویسنده

  • Max I. Kanovich
چکیده

Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order multiplicative commutative linear logic by embedding LJ2 into this logic. Emms did the same for intuitionistic second order non-commutative linear logic. Recently, Lafont and Scedrov demonstrated undecidability of classical second order multiplicative commutative linear logic. As for classical second order non-commutative linear logic, its decidability problem remained open.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NON-STANDARD FINITE DIFFERENCE METHOD FOR NUMERICAL SOLUTION OF SECOND ORDER LINEAR FREDHOLM INTEGRO-DIFFERENTIAL EQUATIONS

In this article we have considered a non-standard finite difference method for the solution of second order  Fredholm integro differential equation type initial value problems. The non-standard finite difference method and the composite trapezoidal quadrature method is used to transform the Fredholm integro-differential equation into a system of equations. We have also developed a numerical met...

متن کامل

Natural Deduction and Normalisation for Partially Commutative Linear Logic and Lambek Calculus with Product

This paper provides a natural deduction system for Partially Commutative Intuitionistic Multiplicative Linear Logic (PCIMLL) and establishes its normalisation and subformula property. Such a system involves both commutative and non commutative connectives and deals with context that are series-parallel multisets of formulæ. This calculus is the extension of the one introduced by de Groote prese...

متن کامل

On the commuting graph of non-commutative rings of order $p^nq$

Let $R$ be a non-commutative ring with unity. The commuting graph of $R$ denoted by $Gamma(R)$, is a graph with vertex set $RZ(R)$ and two vertices $a$ and $b$ are adjacent iff $ab=ba$. In this paper, we consider the commuting graph of non-commutative rings of order pq and $p^2q$ with Z(R) = 0 and non-commutative rings with unity of order $p^3q$. It is proved that $C_R(a)$ is a commutative ring...

متن کامل

Non-Commutative Logic I: The Multiplicative Fragment

We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-commutative disjunction, and the structure of order variety.

متن کامل

Norihiro Kamide TEMPORAL NON - COMMUTATIVE LOGIC : Expressing time , resource , order and hierarchy

A first-order temporal non-commutative logic TN[l], which has no structural rules and has some l-bounded linear-time temporal operators, is introduced as a Gentzen-type sequent calculus. The logic TN[l] allows us to provide not only time-dependent, resource-sensitive, ordered, but also hierarchical reasoning. Decidability, cut-elimination and completeness (w.r.t. phase semantics) theorems are s...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1996